Sierpinski number Totally Explained

Everything about Sierpinski Number totally explained

In number theory, a Sierpinski number is an odd natural number k such that integers of the form k2ⁿ + 1 are composite (for example not prime) for all natural numbers n. In other words, when k is a Sierpinski number, all members of the following set are composite:
ť

left.

In addition, in 1967, Sierpiński and Selfridge proposed (but couldn't prove) the conjecture that 78,557 is the smallest Sierpinski number, and thus the answer to the Sierpinski problem.
To show that 78,557 really is the smallest Sierpinski number, one must show that all the odd numbers smaller than 78,557 are not Sierpinski numbers. That is, there exists an n such that k2ⁿ+1 is prime.(External Link

) As of November 2007, there are only six candidates which have not been eliminated as possible Sierpinski numbers.(External Link

) Seventeen or Bust, a distributed computing project, is testing these remaining numbers.
If the project finds a prime of the right form for all the remaining k, the Sierpinski problem will be solved.

Solved k

A k value is solved when a prime of form k2ⁿ + 1 is found. Here are some cases where a large prime was needed to solve a k:

k=4847 was solved when the number 4847 × 2^3321063 + 1 was found to be prime.(19 October 2005 )
k=5359 was solved when the number 5359 × 2^5054502 + 1 was found to be prime.
k=19249 was solved when the number 19249 × 2^13018586 + 1 was found to be prime.(5 May 2007 )
k=27653 was solved when the number 27653 × 2^9167433 + 1 was found to be prime.(15 June 2005 )
k=28433 was solved when the number 28433 × 2^7830457 + 1 was found to be prime.
k=33661 was solved when the number 33661 × 2^7031232 + 1 was found to be prime.(30 October 2007 )
k=44131 was solved when the number 44131 × 2⁹⁹⁵⁹⁷² + 1 was found to be prime.
k=46157 was solved when the number 46157 × 2⁶⁹⁸²⁰⁷ + 1 was found to be prime.
k=54767 was solved when the number 54767 × 2^1337287 + 1 was found to be prime.
k=65567 was solved when the number 65567 × 2^1013803 + 1 was found to be prime.
k=69109 was solved when the number 69109 × 2^1157446 + 1 was found to be prime.

Remaining k

10223

21181

22699

24737

55459

67607Further Information

Get more info on 'Sierpinski Number'.

External Link Exchanges

Do you know how hard it is to get a link from a large encyclopaedia? Well we're different and will prove it. To get a link from us just add the following HTML to your site on a relevant page:

<a href="http://sierpinski_number.totallyexplained.com">Sierpinski number Totally Explained</a>

Then simply click through this link from your web page. Our crawlers will verify your link, extract the title of your web page and instantly add a link back to it. If you like you can remove the words Totally Explained and embed the link in article text.
As long as your link remains in place, we'll keep our link to you right here. Please play fair - our crawlers are watching. Your site must be closely related to this one's topic. Any kind of spamming, dubious practises or removing the link will result in your link from us being dropped and, potentially, your whole site being banned.